Multiobjective Fractional Programming Problems and Second Order Generalized Hybrid Invexity Frameworks
نویسندگان
چکیده
In this paper, the parametrically generalized sufficient efficiency conditions for multiobjective fractional programming based on the hybrid (Φ, ρ, η, ζ, θ)−invexities are developed, and then efficient solutions to the multiobjective fractional programming problems are established. Furthermore, the obtained results on sufficient efficiency conditions are generalized to the case of the ε−efficient solutions. The results thus obtained generalize and unify a wider range of investigations on the theory and applications to the multiobjective fractional programming based on the hybrid (Φ, ρ, η, ζ, θ)−invexity frameworks.
منابع مشابه
Nonsmooth Multiobjective Fractional Programming with Generalized Invexity
In this paper, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient soluti...
متن کاملMond-Weir type multiobjective second-order fractional symmetric duality with (φ, ρ)-invexity
In this paper, we start our discussion with a pair of multiobjective MondWeir type second-order symmetric dual fractional programming problem and derive weak, strong and strict duality theorems under second-order (φ, ρ)-invexity assumptions.
متن کاملSymmetric duality for multiobjective fractional variational problems with generalized invexity
The concept of symmetric duality for multiobjective fractional problems has been extended to the class of multiobjective variational problems. Weak, strong and converse duality theorems are proved under generalized invexity assumptions. A close relationship between these problems and multiobjective fractional symmetric dual problems is also presented. 2005 Elsevier Inc. All rights reserved.
متن کاملOptimality criteria for sum of fractional multiobjective optimization problem with generalized invexity
The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development ...
متن کاملMultiobjective variational programming under generalized ( V , ρ ) - B - type I functions
Abstract: In this paper, we generalize the (V, ρ)-invexity defined for nonsmooth multiobjective fractional programming by Mishra, Rueda and Giorgi (2003) to variational programming problems by defining new classes of vector-valued functions called (V, ρ)B-type I and generalized (V, ρ)-B-type I. Then we use these new classes to derive various sufficient optimality conditions and mixed type duali...
متن کامل